Refinement of data parallel programs in PEI
نویسندگان
چکیده
Parallel programs mainly diier from sequential ones in that they include geometrical aspects involved by the hardware architecture. We present in this paper the Pei formalism, which enables to take into account both the geometrical and functional aspects of programs. It provides a reenement calculus mainly used to transform the geometrical characteristics of parallel programs, and we show how it may apply on data parallel programs, in particular for data alignments.
منابع مشابه
Asynchronous Parallel Programming in Pei
This paper presents a transformational approach for the derivation of asynchronous parallel programs. Transformation rules are based on a theory, called Pei. This theory includes the deenitions of problems , programs and transformation rules. It is founded on the simple mathematical concepts of multiset and of an equivalence between their representations as data elds. Program transformations ar...
متن کاملData-parallelism versus Functional Programming: the Contribution of Pei
A lot of research works have been done to examine connections between data-parallel and functional programming, as 8, 2] for example, who deene the denotational semantics of a data-parallel language. Some others show how interesting it is to keep or associate a geometry with data-parallel objects: for example, in the automatic parallelization area, a change of basis makes a space-time mapping e...
متن کاملSparse Computation with PEI
Pei formalism has been designed to reason and develop parallel programs in the context of data parallelism. In this paper, we focus on the use of Pei to transform a program involving dense matrices into a new program involving sparse matrices, using the example of the matrix-vector product.
متن کاملBuilding BSP Programs Using the Refinement Calculus
We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed for sequential computing can be generalised to (some) parallel computing environments, and may be useful for managing some of the details of programming in such situations.
متن کاملA Refinement Calculus for Communicating Processes with State
A uniform treatment is presented of specifications, programs, and programming for communicating processes with machine state. The treatment is based on addition of a specification statement to a CSP-like language. The extended language is viewed as a specification language in which programs are identified with a subclass of specifications. A semantics is provided and here a selection of sound r...
متن کامل